Permanents of Circulants: a Transfer Matrix Approach∗ (Extended Abstract)
نویسندگان
چکیده
Calculating the permanent of a (0, 1) matrix is a #P complete problem but there are some classes of structured matrices for which the permanent is calculable in polynomial time. The most well-known example is the fixed-jump (0, 1) circulant matrix which, using algebraic techniques, was shown by Minc to satisfy a constantcoefficient fixed-order recurrence relation. In this note we show how, by interpreting the problem as calculating the number of cycle-covers in a directed circulant graph, it is straightforward to reprove Minc’s result using combinatorial methods. This is a two step process: the first step is to show that the cyclecovers of directed circulant graphs can be evaluated using a transfer matrix argument. The second is to show that the associated transfer matrices, while very large, actually have much smaller characteristic polynomials than would a-priori be expected. An important consequence of this new viewpoint is that, in combination with a new recursive decomposition of circulant-graphs, it permits extending Minc’s result to calculating the permanent of the much larger class of circulant matrices with non-fixed (but linear) jumps.
منابع مشابه
Permanents of Circulants: a Transfer Matrix Approach (expanded Version) *
Calculating the permanent of a (0, 1) matrix is a #P -complete problem but there are some classes of structuredmatrices for which the permanent is calculable in polynomial time. The most well-known example is the fixedjump (0, 1) circulant matrix which, using algebraic techniques, was shown by Minc to satisfy a constant-coefficient fixed-order recurrence relation. In this note we show how, by i...
متن کاملPermanents of Circulants: A Transfer Matrix Approach
Calculating the permanent of a (0, 1) matrix is a #P -complete problem but there are some classes of structuredmatrices for which the permanent is calculable in polynomial time. The most well-known example is the fixed-jump (0, 1) circulant matrix which, using algebraic techniques, was shown by Minc to satisfy a constant-coefficient fixed-order recurrence relation. In this note we show how, by ...
متن کاملAn algorithm for the permanent of circulant matrices
The permanent of an n x n matrix A = (a;j) is the matrix function ( 1) per A = ∑ al1r(1)••• a .. ",( .. )".C~" where the summation is over all permutations in the symmetric group, S ... An n x n matrix A is a circulant if there are scalars ab ... ,a,. such that (2) A= ∑ a;pi-l where P is the n x n permutation matrix corresponding to the cycle (12• .. n) in s". In general the computation of the ...
متن کاملOn the sum of Pell and Jacobsthal numbers by matrix method
In this paper, we define two $n$-square upper Hessenberg matrices one of which corresponds to the adjacency matrix of a directed pseudo graph. We investigate relations between permanents and determinants of these upper Hessenberg matrices, and sum formulas of the well-known Pell and Jacobsthal sequences. Finally, we present two Maple 13 procedures in order to calculate permanents of t...
متن کاملDeterminants and permanents of Hessenberg matrices and generalized Lucas polynomials
In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...
متن کامل